Overview and analysis of the SAT Challenge 2012 solver competition

نویسندگان

  • Adrian Balint
  • Anton Belov
  • Matti Järvisalo
  • Carsten Sinz
چکیده

Programs for the Boolean satisfiability problem (SAT), i.e., SAT solvers, are nowadays used as core decision procedures for a wide range of combinatorial problems. Advances in SAT solving during the last 10–15 years have been spurred by yearly solver competitions. In this article, we report on the main SAT solver competition held in 2012, SAT Challenge 2012. Besides providing an overview of how SAT Challenge 2012 was organized, we present an in-depth analysis of key aspects of the results obtained during the competition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lingeling, Plingeling and Treengeling Entering the SAT Competition 2013

This paper serves as solver description for our SAT solver Lingeling and its two parallel variants Treengeling and Plingeling entering the SAT Competition 2013. We only list important differences to the version of these solvers used in the SAT Challenge 2012. For further information we refer to the solver description [1] of the SAT Challenge 2012 or source code.

متن کامل

The International SAT Solver Competitions

is satisfiable is one of the most fundamental problems in computer science, known as the canonical NP-complete Boolean satisfiability (SAT) problem (Biere et al. 2009). In addition to its theoretical importance, major advances in the development of robust implementations of decision procedures for SAT, SAT solvers, have established SAT as an important declarative approach for attacking various ...

متن کامل

SAT Competition 2016: Recent Developments

We give an overview of SAT Competition 2016, the 2016 edition of the famous competition for Boolean satisfiability (SAT) solvers with over 20 years of history. A key aim is to point out “what’s hot” in SAT competitions in 2016, i.e., new developments in the competition series, including new competition tracks and new solver techniques implemented in some of the award-winning solvers.

متن کامل

The Evolution from LIMMAT to NANOSAT

In this technical report we summarize the evolution of SAT solvers implemented at the formal methods group at ETH Zürich. We start with LIMMAT and COMPSAT, which both took part in the SAT’03 SAT solver competition. From the more ambitious design of FUNEX we reach the minimal implementation of NANOSAT. We close the discussion with an overview on how our QBF solver QUANTOR can be used as a prepro...

متن کامل

Contrasat - A Contrarian SAT Solver

The SAT solver Contrasat is a small variation of the well-established Minisat solver. It was entered in the Minisat hack track of the 2011 SAT competition, and was judged to be first place in one category. This paper describes the code change and its motivation. The characterization as “contrarian” is explained. Experimental results are summarized.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Artif. Intell.

دوره 223  شماره 

صفحات  -

تاریخ انتشار 2015